A summation method for linearly ordered series
نویسندگان
چکیده
منابع مشابه
A new summation method for power series with rational coefficients
We show that an asymptotic summation method, recently proposed by the authors, can be conveniently applied to slowly convergent power series whose coefficients are rational functions of the summation index. Several numerical examples are presented. 1. Asymptotic summation Consider a power series ∞ ∑
متن کاملLinearly Ordered Topological Spaces
This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...
متن کاملDecision methods for linearly ordered Heyting algebras
This paper presents a simple decision method for positively quantified formulae of the classical firstorder theory LOHA of linearly ordered Heyting algebras, where by positively quantified we mean that universal quantifiers appear only in positive positions and existential quantifiers appear only in negative positions. Π1-formulae are examples. In particular, word problems, either in LOHA or in...
متن کاملQuasimartingales with a Linearly Ordered Index Set
We consider quasi-martingales indexed by a linearly order set. We show that such processes are isomorphic to a given class of (finitely additive) measures. From this result we easily derive the classical theorem of Stricker as well as the decompositions of Riesz, Rao and the supermartingale decomposition of Doob and Meyer.
متن کاملA Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1981
ISSN: 0386-2194
DOI: 10.3792/pjaa.57.64